Approximation algorithms - PDFSEARCH.IO - Document Search Engine

Approximation algorithms
Results: 332

#	Item
181	New Approximation Algorithms for Minimum Enclosing Convex Shapes Ankan Saha∗ S.V. N. Vishwanathan† Add to Reading List Source URL: people.cs.uchicago.edu Language: English - Date: 2010-11-03 13:53:29 Convex optimization Applied mathematics Linear programming Approximation algorithm Subgradient method Combinatorial optimization Mathematical optimization Operations research Theoretical computer science
182	All-or-Nothing Generalized Assignment with Application to Scheduling Advertising Campaigns Ron Adany1 , Moran Feldman2 , Elad Haramaty2 , Rohit Khandekar3 , Baruch Schieber4 , Roy Schwartz5 , Hadas Shachnai2 , and Tami T Add to Reading List Source URL: www.cs.technion.ac.il Language: English - Date: 2013-01-05 09:50:09 Complexity classes Approximation algorithms NP-complete problems Matroid theory Generalized assignment problem Knapsack problem Submodular set function APX Polynomial-time approximation scheme Theoretical computer science Computational complexity theory Applied mathematics
183	CCCG 2006, Kingston, Ontario, August 14–16, 2006 K-Nearest Neighbor Search using the Pyramid Technique Bradford G. Nickerson Abstract Add to Reading List Source URL: cccg.ca Language: English - Date: 2008-10-27 22:59:17 Artificial intelligence Machine learning Numerical analysis Approximation algorithms Information retrieval Nearest neighbor search K-nearest neighbor algorithm K-d tree Curse of dimensionality Information science Search algorithms Mathematics
184	Optimal Data-Dependent Hashing for Approximate Near Neighbors Alexandr Andoni1 1 Simons 2 MIT, Add to Reading List Source URL: www.ilyaraz.org Language: English - Date: 2015-04-20 15:32:53 Search algorithms Discrete geometry Data mining Machine learning Approximation algorithms Nearest neighbor search Voronoi diagram Computational geometry K-nearest neighbor algorithm Information science Mathematics Geometry
185	Approximation Algorithms and Hardness Results for Shortest Path Based Graph Orientations Dima Blokh1 Danny Segev2 Roded Sharan1 1. School of Computer Science, Tel Aviv University, 2. Department of Statistics, University Add to Reading List Source URL: www.cs.ucr.edu Language: English - Date: 2012-12-29 15:22:26 Network theory Graph connectivity Shortest path problem Path Graph theory Mathematics Theoretical computer science
186	1 Performance Analysis of Quantization-based Approximation Algorithms for Precomputing the Supported QoS Ronghui Hou, King-Shan Lui, Ka-Cheong Leung, and Fred Baker Add to Reading List Source URL: www.eee.hku.hk Language: English - Date: 2012-06-13 00:42:16 Streaming Telecommunications engineering Teletraffic Operations research Mathematics Quality of service Mathematical optimization Approximation algorithm Optimization problem Theoretical computer science Applied mathematics Network performance
187	Approximation Algorithms for Orienting Mixed Graphs Add to Reading List Source URL: www.cs.ucr.edu Language: English - Date: 2011-09-25 15:14:20 NP-complete problems Graph Directed graph Strongly connected component Strong orientation Graph coloring Path decomposition Graph theory Mathematics Graph connectivity
188	Online Algorithms for 1-Space Bounded Multi Dimensional Bin Packing and Hypercube Packing Yong Zhang∗ Francis Y.L. Chin† Add to Reading List Source URL: i.cs.hku.hk Language: English - Date: 2012-02-07 01:51:04 Discrete geometry Bin packing problem Packing problem Approximation algorithm Competitive analysis Mathematics Theoretical computer science Applied mathematics
189	Algorithms for Three Versions of the Shortest Common Superstring Problem Maxime Crochemore, Marek Cygan, Costas Iliopoulos, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen Add to Reading List Source URL: www.cs.ucr.edu Language: English - Date: 2010-08-20 17:45:58 Superstring theory Computer science Mathematics Computational complexity theory Approximation algorithm NP-complete
190	Parameterized Algorithmics for Computational Social Choice: Nine Research Challenges Robert Bredereck1 , Jiehua Chen1 , Piotr Faliszewski2 , Jiong Guo3 , Rolf Niedermeier1 , and Gerhard J. Woeginger4 1 Add to Reading List Source URL: fpt.akt.tu-berlin.de Language: English - Date: 2014-12-01 07:16:49 Analysis of algorithms NP-complete problems Complexity classes Parameterized complexity Kernelization Vertex cover Time complexity Combinatorial optimization Approximation algorithm Theoretical computer science Computational complexity theory Applied mathematics

UPDATE